in ri a - 00 28 16 31 , v er si on 1 - 2 4 M ay 2 00 8 Focusing in linear meta - logic : extended report

نویسندگان

  • Vivek Nigam
  • Dale Miller
چکیده

It is well known how to use an intuitionistic meta-logic to specify natural deduction systems. It is also possible to use linear logic as a meta-logic for the specification of a variety of sequent calculus proof systems. Here, we show that if we adopt different focusing annotations for such linear logic specifications, a range of other proof systems can also be specified. In particular, we show that natural deduction (normal and non-normal), sequent proofs (with and without cut), tableaux, and proof systems using general elimination and general introduction rules can all be derived from essentially the same linear logic specification by altering focusing annotations. By using elementary linear logic equivalences and the completeness of focused proofs, we are able to derive new and modular proofs of the soundness and completeness of these various proofs systems for intuitionistic and classical logics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mathematical study of a neural gain control mechanism

This report presents a dynamical mechanism of gain control, inspired by a simple membranar model for neurons. Mathematical results are enounced for the system under sinusoidal stimulation. We thus prove that the system induces under-linearity with input ampitude, and time advance for high input amplitudes, which are the dual mark of contrast gain control in retinal neurons. Key-words: Gain cont...

متن کامل

The vertebrate retina: a functional review

In this report, we summarize the major properties of retinal filtering and organization, as understood by numerous experiments and models over the last decades. For this review, we take a functional approach, trying to answer this apparently simple question: What are the main characteristics of the retinal output in terms of signal processing, which should be retained in a functional model? Key...

متن کامل

in ri a - 00 00 11 64 , v er si on 1 - 2 4 M ar 2 00 6 A unifying framework for seed sensitivity and its application to subset seeds ( Extended abstract )

We propose a general approach to compute the seed sensitivity, that can be applied to different definitions of seeds. It treats separately three components of the seed sensitivity problem – a set of target alignments, an associated probability distribution, and a seed model – that are specified by distinct finite automata. The approach is then applied to a new concept of subset seeds for which ...

متن کامل

RTES-03 Interfaces.indd

[ B ur ns 20 07 ] B u rn s, A & W el lin gs , A C o n cu rr en t a n d R ea l-T im e Pr o gr am m in g in A d a, e d it io n C am b ri d ge U n iv er si ty P re ss 2 00 7 [ M o to ro la 19 96 ] M o to ro la Ti m e Pr o ce ss in g U n it R ef er en ce M an u al 1 99 6 p p . 1 -1 42 [ M o to ro la 20 00 ] M o to ro la M PC 56 5 & M PC 56 6 2 00 0 p p . 1 -1 31 2 [ P ea co ck 19 97 ] Pe ac o ck , ...

متن کامل

in ri a - 00 16 72 25 , v er si on 1 - 1 6 A ug 2 00 7 Collection Analysis for Horn Clause Programs

We consider approximating data structures with collections of the items that they contain. For examples, lists, binary trees, tuples, etc, can be approximated by sets or multisets of the items within them. Such approximations can be used to provide partial correctness properties of logic programs. For example, one might wish to specify than whenever the atom sort(t, s) is proved then the two li...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008